Geodesic Distance Function Learning via Heat Flow on Vector Fields

Learning a distance function or metric on a given data manifold is of great importance in machine learning and pattern recognition. Many of the previous works first embed the manifold to Euclidean space and then learn the distance function. However, such a scheme might not faithfully preserve the distance function if the original manifold is not Euclidean. Note that the distance function on a manifold can always be well-defined. In this paper, we propose to learn the distance function directly on the manifold without embedding. We first provide a theoretical characterization of the distance function by its gradient field. Based on our theoretical analysis, we propose to first learn the gradient field of the distance function and then learn the distance function itself. Specifically, we set the gradient field of a local distance function as an initial vector field. Then we transport it to the whole manifold via heat flow on vector fields. Finally, the geodesic distance function can be obtained by requiring its gradient field to be close to the normalized vector field. Experimental results on both synthetic and real data demonstrate the effectiveness of our proposed algorithm

A new framework of human interaction recognition based on multiple stage probability fusion

Visual-based human interactive behavior recognition is a challenging research topic in computer vision. There exist some important problems in the current interaction recognition algorithms, such as very complex feature representation and inaccurate feature extraction induced by wrong human body segmentation. In order to solve these problems, a novel human interaction recognition method based on multiple stage probability fusion is proposed in this paper. According to the human body’s contact in interaction as a cut-off point, the process of the interaction can be divided into three stages: start stage, execution stage and end stage. Two persons’ motions are respectively extracted and recognizes in the start stage and the finish stage when there is no contact between those persons. The two persons’ motion is extracted as a whole and recognized in the execution stage. In the recognition process, the final recognition results are obtained by the weighted fusing these probabilities in different stages. The proposed method not only simplifies the extraction and representation of features, but also avoids the wrong feature extraction caused by occlusion. Experiment results on the UT-interaction dataset demonstrated that the proposed method results in a better performance than other recent interaction recognition methods

A new framework of human interaction recognition based on multiple stage probability fusion

Visual-based human interactive behavior recognition is a challenging research topic in computer vision. There exist some important problems in the current interaction recognition algorithms, such as very complex feature representation and inaccurate feature extraction induced by wrong human body segmentation. In order to solve these problems, a novel human interaction recognition method based on multiple stage probability fusion is proposed in this paper. According to the human body’s contact in interaction as a cut-off point, the process of the interaction can be divided into three stages: start stage, execution stage and end stage. Two persons’ motions are respectively extracted and recognizes in the start stage and the finish stage when there is no contact between those persons. The two persons’ motion is extracted as a whole and recognized in the execution stage. In the recognition process, the final recognition results are obtained by the weighted fusing these probabilities in different stages. The proposed method not only simplifies the extraction and representation of features, but also avoids the wrong feature extraction caused by occlusion. Experiment results on the UT-interaction dataset demonstrated that the proposed method results in a better performance than other recent interaction recognition methods

Parallel numerical simulation for a super large-scale compositional reservoir

 A compositional reservoir simulation model with ten-million grids is successfully computed using parallel processing techniques. The load balance optimization principle for parallel calculation is developed, which improves the calculation speed and accuracy, and provides a reliable basis for the design of reservoir development plan. Taking M reservoir as an example, the parallel numerical simulation study of compositional model with ten million grids is carried out. When the number of computational nodes increases, message passing processes and data exchange take much time, the proportion time of solving equation is reduced. When the CPU number increases, the creation of Jacobian matrix process has the higher acceleration ratio, and the acceleration ratio of I/O process become lower. Therefore, the I/O process is the key to improve the acceleration ratio. Finally, we study the use of GPU and CPU parallel acceleration technology to increase the calculation speed. The results show that the technology is 2.4 ∼ 5.4 times faster than CPU parallel technology. The more grids there are, the better GPU acceleration effect it has. The technology of parallel numerical simulation for compositional model with ten-million grids presented in this paper has provided the foundation for fine simulation of complex reservoirs.Cited as: Lian, P., Ji, B., Duan, T., Zhao, H., Shang, X. Parallel numerical simulation for a super large-scale compositional reservoir. Advances in Geo-Energy Research, 2019, 3(4): 381-386, doi: 10.26804/ager.2019.04.0